The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

select(x', revprefix, Cons(x, xs)) → mapconsapp(x', permute(revapp(revprefix, Cons(x, xs))), select(x, Cons(x', revprefix), xs))
revapp(Cons(x, xs), rest) → revapp(xs, Cons(x, rest))
permute(Cons(x, xs)) → select(x, Nil, xs)
mapconsapp(x', Cons(x, xs), rest) → Cons(Cons(x', x), mapconsapp(x', xs, rest))
select(x, revprefix, Nil) → mapconsapp(x, permute(revapp(revprefix, Nil)), Nil)
revapp(Nil, rest) → rest
permute(Nil) → Cons(Nil, Nil)
mapconsapp(x, Nil, rest) → rest
goal(xs) → permute(xs)

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

select(x', revprefix, Cons(x, xs)) → mapconsapp(x', permute(revapp(revprefix, Cons(x, xs))), select(x, Cons(x', revprefix), xs))
revapp(Cons(x, xs), rest) → revapp(xs, Cons(x, rest))
permute(Cons(x, xs)) → select(x, Nil, xs)
mapconsapp(x', Cons(x, xs), rest) → Cons(Cons(x', x), mapconsapp(x', xs, rest))
select(x, revprefix, Nil) → mapconsapp(x, permute(revapp(revprefix, Nil)), Nil)
revapp(Nil, rest) → rest
permute(Nil) → Cons(Nil, Nil)
mapconsapp(x, Nil, rest) → rest
goal(xs) → permute(xs)

S is empty.
Rewrite Strategy: INNERMOST

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
select(x', revprefix, Cons(x, xs)) → mapconsapp(x', permute(revapp(revprefix, Cons(x, xs))), select(x, Cons(x', revprefix), xs))
revapp(Cons(x, xs), rest) → revapp(xs, Cons(x, rest))
permute(Cons(x, xs)) → select(x, Nil, xs)
mapconsapp(x', Cons(x, xs), rest) → Cons(Cons(x', x), mapconsapp(x', xs, rest))
select(x, revprefix, Nil) → mapconsapp(x, permute(revapp(revprefix, Nil)), Nil)
revapp(Nil, rest) → rest
permute(Nil) → Cons(Nil, Nil)
mapconsapp(x, Nil, rest) → rest
goal(xs) → permute(xs)

Types:
select :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
Cons :: Cons:Nil → Cons:Nil → Cons:Nil
mapconsapp :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
permute :: Cons:Nil → Cons:Nil
revapp :: Cons:Nil → Cons:Nil → Cons:Nil
Nil :: Cons:Nil
goal :: Cons:Nil → Cons:Nil
hole_Cons:Nil1_0 :: Cons:Nil
gen_Cons:Nil2_0 :: Nat → Cons:Nil

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
select, mapconsapp, permute, revapp

They will be analysed ascendingly in the following order:
mapconsapp < select
select = permute
revapp < select

(6) Obligation:

Innermost TRS:
Rules:
select(x', revprefix, Cons(x, xs)) → mapconsapp(x', permute(revapp(revprefix, Cons(x, xs))), select(x, Cons(x', revprefix), xs))
revapp(Cons(x, xs), rest) → revapp(xs, Cons(x, rest))
permute(Cons(x, xs)) → select(x, Nil, xs)
mapconsapp(x', Cons(x, xs), rest) → Cons(Cons(x', x), mapconsapp(x', xs, rest))
select(x, revprefix, Nil) → mapconsapp(x, permute(revapp(revprefix, Nil)), Nil)
revapp(Nil, rest) → rest
permute(Nil) → Cons(Nil, Nil)
mapconsapp(x, Nil, rest) → rest
goal(xs) → permute(xs)

Types:
select :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
Cons :: Cons:Nil → Cons:Nil → Cons:Nil
mapconsapp :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
permute :: Cons:Nil → Cons:Nil
revapp :: Cons:Nil → Cons:Nil → Cons:Nil
Nil :: Cons:Nil
goal :: Cons:Nil → Cons:Nil
hole_Cons:Nil1_0 :: Cons:Nil
gen_Cons:Nil2_0 :: Nat → Cons:Nil

Generator Equations:
gen_Cons:Nil2_0(0) ⇔ Nil
gen_Cons:Nil2_0(+(x, 1)) ⇔ Cons(Nil, gen_Cons:Nil2_0(x))

The following defined symbols remain to be analysed:
mapconsapp, select, permute, revapp

They will be analysed ascendingly in the following order:
mapconsapp < select
select = permute
revapp < select

(7) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol mapconsapp.

(8) Obligation:

Innermost TRS:
Rules:
select(x', revprefix, Cons(x, xs)) → mapconsapp(x', permute(revapp(revprefix, Cons(x, xs))), select(x, Cons(x', revprefix), xs))
revapp(Cons(x, xs), rest) → revapp(xs, Cons(x, rest))
permute(Cons(x, xs)) → select(x, Nil, xs)
mapconsapp(x', Cons(x, xs), rest) → Cons(Cons(x', x), mapconsapp(x', xs, rest))
select(x, revprefix, Nil) → mapconsapp(x, permute(revapp(revprefix, Nil)), Nil)
revapp(Nil, rest) → rest
permute(Nil) → Cons(Nil, Nil)
mapconsapp(x, Nil, rest) → rest
goal(xs) → permute(xs)

Types:
select :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
Cons :: Cons:Nil → Cons:Nil → Cons:Nil
mapconsapp :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
permute :: Cons:Nil → Cons:Nil
revapp :: Cons:Nil → Cons:Nil → Cons:Nil
Nil :: Cons:Nil
goal :: Cons:Nil → Cons:Nil
hole_Cons:Nil1_0 :: Cons:Nil
gen_Cons:Nil2_0 :: Nat → Cons:Nil

Generator Equations:
gen_Cons:Nil2_0(0) ⇔ Nil
gen_Cons:Nil2_0(+(x, 1)) ⇔ Cons(Nil, gen_Cons:Nil2_0(x))

The following defined symbols remain to be analysed:
revapp, select, permute

They will be analysed ascendingly in the following order:
select = permute
revapp < select

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
revapp(gen_Cons:Nil2_0(n3616860_0), gen_Cons:Nil2_0(b)) → gen_Cons:Nil2_0(+(n3616860_0, b)), rt ∈ Ω(1 + n3616860₀)

Induction Base:
revapp(gen_Cons:Nil2_0(0), gen_Cons:Nil2_0(b)) →_R^Ω(1)
gen_Cons:Nil2_0(b)

Induction Step:
revapp(gen_Cons:Nil2_0(+(n3616860_0, 1)), gen_Cons:Nil2_0(b)) →_R^Ω(1)
revapp(gen_Cons:Nil2_0(n3616860_0), Cons(Nil, gen_Cons:Nil2_0(b))) →_IH
gen_Cons:Nil2_0(+(+(b, 1), c3616861_0))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

Innermost TRS:
Rules:
select(x', revprefix, Cons(x, xs)) → mapconsapp(x', permute(revapp(revprefix, Cons(x, xs))), select(x, Cons(x', revprefix), xs))
revapp(Cons(x, xs), rest) → revapp(xs, Cons(x, rest))
permute(Cons(x, xs)) → select(x, Nil, xs)
mapconsapp(x', Cons(x, xs), rest) → Cons(Cons(x', x), mapconsapp(x', xs, rest))
select(x, revprefix, Nil) → mapconsapp(x, permute(revapp(revprefix, Nil)), Nil)
revapp(Nil, rest) → rest
permute(Nil) → Cons(Nil, Nil)
mapconsapp(x, Nil, rest) → rest
goal(xs) → permute(xs)

Types:
select :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
Cons :: Cons:Nil → Cons:Nil → Cons:Nil
mapconsapp :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
permute :: Cons:Nil → Cons:Nil
revapp :: Cons:Nil → Cons:Nil → Cons:Nil
Nil :: Cons:Nil
goal :: Cons:Nil → Cons:Nil
hole_Cons:Nil1_0 :: Cons:Nil
gen_Cons:Nil2_0 :: Nat → Cons:Nil

Lemmas:
revapp(gen_Cons:Nil2_0(n3616860_0), gen_Cons:Nil2_0(b)) → gen_Cons:Nil2_0(+(n3616860_0, b)), rt ∈ Ω(1 + n3616860₀)

Generator Equations:
gen_Cons:Nil2_0(0) ⇔ Nil
gen_Cons:Nil2_0(+(x, 1)) ⇔ Cons(Nil, gen_Cons:Nil2_0(x))

The following defined symbols remain to be analysed:
permute, select

They will be analysed ascendingly in the following order:
select = permute

(12) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol permute.

(13) Obligation:

Innermost TRS:
Rules:
select(x', revprefix, Cons(x, xs)) → mapconsapp(x', permute(revapp(revprefix, Cons(x, xs))), select(x, Cons(x', revprefix), xs))
revapp(Cons(x, xs), rest) → revapp(xs, Cons(x, rest))
permute(Cons(x, xs)) → select(x, Nil, xs)
mapconsapp(x', Cons(x, xs), rest) → Cons(Cons(x', x), mapconsapp(x', xs, rest))
select(x, revprefix, Nil) → mapconsapp(x, permute(revapp(revprefix, Nil)), Nil)
revapp(Nil, rest) → rest
permute(Nil) → Cons(Nil, Nil)
mapconsapp(x, Nil, rest) → rest
goal(xs) → permute(xs)

Types:
select :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
Cons :: Cons:Nil → Cons:Nil → Cons:Nil
mapconsapp :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
permute :: Cons:Nil → Cons:Nil
revapp :: Cons:Nil → Cons:Nil → Cons:Nil
Nil :: Cons:Nil
goal :: Cons:Nil → Cons:Nil
hole_Cons:Nil1_0 :: Cons:Nil
gen_Cons:Nil2_0 :: Nat → Cons:Nil

Lemmas:
revapp(gen_Cons:Nil2_0(n3616860_0), gen_Cons:Nil2_0(b)) → gen_Cons:Nil2_0(+(n3616860_0, b)), rt ∈ Ω(1 + n3616860₀)

Generator Equations:
gen_Cons:Nil2_0(0) ⇔ Nil
gen_Cons:Nil2_0(+(x, 1)) ⇔ Cons(Nil, gen_Cons:Nil2_0(x))

The following defined symbols remain to be analysed:
select

They will be analysed ascendingly in the following order:
select = permute

(14) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol select.

(15) Obligation:

Innermost TRS:
Rules:
select(x', revprefix, Cons(x, xs)) → mapconsapp(x', permute(revapp(revprefix, Cons(x, xs))), select(x, Cons(x', revprefix), xs))
revapp(Cons(x, xs), rest) → revapp(xs, Cons(x, rest))
permute(Cons(x, xs)) → select(x, Nil, xs)
mapconsapp(x', Cons(x, xs), rest) → Cons(Cons(x', x), mapconsapp(x', xs, rest))
select(x, revprefix, Nil) → mapconsapp(x, permute(revapp(revprefix, Nil)), Nil)
revapp(Nil, rest) → rest
permute(Nil) → Cons(Nil, Nil)
mapconsapp(x, Nil, rest) → rest
goal(xs) → permute(xs)

Types:
select :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
Cons :: Cons:Nil → Cons:Nil → Cons:Nil
mapconsapp :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
permute :: Cons:Nil → Cons:Nil
revapp :: Cons:Nil → Cons:Nil → Cons:Nil
Nil :: Cons:Nil
goal :: Cons:Nil → Cons:Nil
hole_Cons:Nil1_0 :: Cons:Nil
gen_Cons:Nil2_0 :: Nat → Cons:Nil

Lemmas:
revapp(gen_Cons:Nil2_0(n3616860_0), gen_Cons:Nil2_0(b)) → gen_Cons:Nil2_0(+(n3616860_0, b)), rt ∈ Ω(1 + n3616860₀)

Generator Equations:
gen_Cons:Nil2_0(0) ⇔ Nil
gen_Cons:Nil2_0(+(x, 1)) ⇔ Cons(Nil, gen_Cons:Nil2_0(x))

No more defined symbols left to analyse.

(16) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
revapp(gen_Cons:Nil2_0(n3616860_0), gen_Cons:Nil2_0(b)) → gen_Cons:Nil2_0(+(n3616860_0, b)), rt ∈ Ω(1 + n3616860₀)

(17) BOUNDS(n^1, INF)

(18) Obligation:

Innermost TRS:
Rules:
select(x', revprefix, Cons(x, xs)) → mapconsapp(x', permute(revapp(revprefix, Cons(x, xs))), select(x, Cons(x', revprefix), xs))
revapp(Cons(x, xs), rest) → revapp(xs, Cons(x, rest))
permute(Cons(x, xs)) → select(x, Nil, xs)
mapconsapp(x', Cons(x, xs), rest) → Cons(Cons(x', x), mapconsapp(x', xs, rest))
select(x, revprefix, Nil) → mapconsapp(x, permute(revapp(revprefix, Nil)), Nil)
revapp(Nil, rest) → rest
permute(Nil) → Cons(Nil, Nil)
mapconsapp(x, Nil, rest) → rest
goal(xs) → permute(xs)

Types:
select :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
Cons :: Cons:Nil → Cons:Nil → Cons:Nil
mapconsapp :: Cons:Nil → Cons:Nil → Cons:Nil → Cons:Nil
permute :: Cons:Nil → Cons:Nil
revapp :: Cons:Nil → Cons:Nil → Cons:Nil
Nil :: Cons:Nil
goal :: Cons:Nil → Cons:Nil
hole_Cons:Nil1_0 :: Cons:Nil
gen_Cons:Nil2_0 :: Nat → Cons:Nil

Lemmas:
revapp(gen_Cons:Nil2_0(n3616860_0), gen_Cons:Nil2_0(b)) → gen_Cons:Nil2_0(+(n3616860_0, b)), rt ∈ Ω(1 + n3616860₀)

Generator Equations:
gen_Cons:Nil2_0(0) ⇔ Nil
gen_Cons:Nil2_0(+(x, 1)) ⇔ Cons(Nil, gen_Cons:Nil2_0(x))

No more defined symbols left to analyse.

(19) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
revapp(gen_Cons:Nil2_0(n3616860_0), gen_Cons:Nil2_0(b)) → gen_Cons:Nil2_0(+(n3616860_0, b)), rt ∈ Ω(1 + n3616860₀)

(20) BOUNDS(n^1, INF)